Symmetricity of the Solution of Semidefinite Program
نویسندگان
چکیده
Symmetricity of an optimal solution of SemiDefinite Program (SDP) with certain symmetricity is discussed based on symmetry property of the central path that is traced by a primaldual interior-point method. Introducing some operators for rearranging elements of matrices and vectors, three types of symmetric SDPs are defined by using those operators. The symmetricity of the solution on the central path is proved for each of symmetric SDPs. Therefore, it is theoretically guaranteed that a symmetric optimal solution is always obtained by using a primal-dual interiorpoint method even if there are other asymmetric optimal solutions. As an application of this result, we consider topology optimization problems of symmetric trusses that belong to one of the three types of symmetric SDPs, and we shall show that the symmetric optimal solution can be found regardless of the choice of member numbering and coordinate systems. Numerical experiments by using several algorithms for SDP illustrate rapid convergence to strictly symmetric solutions.
منابع مشابه
Architectural Information Systems Laboratory Department of Architecture and Architectural Systems Kyoto university Sakyo , Kyoto 606 - 8501 , Japan Symmetricity of the Solution of Semidefinite Program
Symmetricity of an optimal solution of Semi-Definite Program (SDP) with certain symmetricity is discussed based on symmetry property of the central path that is traced by a primal-dual interior-point method. A symmetric SDP is defined by operators for rearranging elements of matrices and vectors, and the solution on the central path is proved to be symmetric. Therefore, it is theoretically guar...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملBad Semidefinite Programs: They All Look the Same
Duality theory plays a central role in semidefinite programming, since in optimization algorithms a dual solution serves as a certificate of optimality. However, in semidefinite duality pathological phenomena occur: nonattainment of the optimal value, positive duality gaps, and infeasibility of the dual, even when the primal is bounded. We say that the semidefinite system PSD = {x | ∑m i=1 xiAi...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کامل